Probabilistically Reliable Default Reasoning

نویسندگان

  • Gerhard Schurz
  • Alexander Hieke
چکیده

This paper superimposes an assumption generation mechanism (AGM) and a lower bound propagation mechanism (LBM) on default reasoning. AGM generates minimal probabilistic assumptions which are needed to derive default conclusions safely, and LBM supplies (approximately) tight lower probability bounds of the conclusions. Together both mechanisms make default reasoning probabilistically reliable. The underlying logical framework is an extension of Adams’ probability logic P by irrelevance and contraposition assumptions, called the system P DP. There is an exact correspondence between Poole-extensions and P DP-extensions. The procedure for P DPentailment is comparable in complexity with Poole’s procedure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Default and Likelihood Reasoning as Probabilistic

This paper presents a probabilistic analysis of plausible reasoning about defaults and about likelihood. "Likely" and "by default" are in fact treated as duals in the same sense as _possibility" and "necessity". To model these four forms probabilistically, a logic QDP and its quantitative counterpart DP are derived that allow qualitative and corresponding quantitative reasoning. Consistency and...

متن کامل

Non-Monotonic Reasoning from an Evolution-Theoretic Perspective: Ontic, Logical and Cognitive Foundations

In the first part I argue that normic laws are the phenomenological laws of evolutionary systems. If this is true, then intuitive human reasoning should be fit in reasoning from normic laws. In the second part I show that system P is a tool for reasoning with normic laws which satisfies two important evolutionary standards: it is probabilistically reliable, and it has rules of low complexity. I...

متن کامل

Preferred Subtheories: An Extended Logical Framework for Default Reasoning

We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole's THEORIST approach to default reasoning as a particular instance. A disadvantage of THEORIST is that it does not allow to represent priorities between defaults adequately (as distinct from blocking defaults in specific...

متن کامل

Declarative Semantics for Contradictory Modular Logic Programs

A complex reasoning system can be designed as an interaction between reasoning modules. A module consists of a declaration of exported/imported predicates and a set of rules containing both negation by default and classical negation. A prioritized modular logic program (PMP) consists of a set of modules and a partial order <def on the predicate definitions (M, p), where M is a module and p is a...

متن کامل

Axiomatization of Credulous Reasoning in Rational Default Logic

Nonmonotonic reasoning is succesfully formalized by the class of default logics. In this paper we introduce an axiomatic system for credulous reasoning in rational default logic. Based on classical sequent calculus and anti-sequent calculus, an abstract characterization of credulous nonmonotonic default inference in this variant of default logic is presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997